Cryptographic Boolean functions: One output, many design criteria

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Cryptographic Boolean functions: One output, many design criteria

Boolean functions represent an important primitive in the design of various cryptographic algorithms. There exist several well-known schemes where a Boolean functions is used to add nonlinearity to the cipher. Thus, methods to generate Boolean functions that possess good cryptographic properties is an important research goal. Among other techniques, evolutionary computation has proved to be a w...

متن کامل

Cryptographic Criteria on Vector Boolean Functions

Most modern block and stream ciphers can be expressed as certain arrangement of Vector Boolean Functions. Thus, in the context of block and stream ciphers’ design (mainly in S-boxes and combining functions respectively), it is essential to define criteria which measure the cryptographic strength of Boolean Functions and Vector Boolean Functions. Ideally, some of the following requirements must ...

متن کامل

New balanced Boolean functions satisfying all the main cryptographic criteria

We study an infinite class of functions which provably achieve an optimum algebraic immunity, an optimum algebraic degree and a good nonlinearity. We checked that it has also a good behavior against fast algebraic attacks.

متن کامل

Design of SAC/PC(l) of Order k Boolean Functions and Three Other Cryptographic Criteria

A Boolean function f satis es PC(l) of order k if f(x) f(x ) is balanced for any such that 1 W ( ) l even if any k input bits are kept constant, where W ( ) denotes the Hamming weight of . This paper shows the rst design method of such functions which provides deg(f) 3. More than that, we show how to design \balanced" such functions. High nonlinearity and large degree are also obtained. Further...

متن کامل

Cryptographic Boolean Functions with R

A Boolean function is a mapping {0,1}n → {0,1}. Those mappings are of much interest in the design of cryptographic algorithms such as secure pseudorandom number generators (for the design of stream ciphers among other applications), hash functions and block ciphers. The lack of open source software to assess cryptographic properties of Boolean functions and the increasing interest for statistic...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Applied Soft Computing

سال: 2016

ISSN: 1568-4946

DOI: 10.1016/j.asoc.2015.10.066